Non-crossing Trees, Quadrangular Dissections, Ternary Trees, and Duality-Preserving Bijections

نویسندگان

چکیده

Using the theory of Properly Embedded Graphs developed in an earlier work we define involutory duality on set labeled non-crossing trees that lifts obvious unlabeled trees. The is a free ternary magma with one generator and this instance defined any such magma. Any two magmas are isomorphic via unique isomorphism call structural bijection. Besides also consider as trees, quadrangular dissections, flagged Perfectly Chain Decomposed Ditrees, give topological and/or combinatorial interpretations bijections between them. In particular bijection from dissections to seems be new. Further explicit formulas for number self-dual up rotations reflections.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bijections for ternary trees and non-crossing trees

The number Nn of non-crossing trees of size n satis/es Nn+1 = Tn where Tn enumerates ternary trees of size n. We construct a new bijection to establish that fact. Since Tn =(1=(2n+ 1))( 3n n ), it follows that 3(3n− 1)(3n− 2)Tn−1 = 2n(2n+ 1)Tn. We construct two bijections “explaining” this recursion; one of them easily extends to the case of t-ary trees. c © 2002 Elsevier Science B.V. All right...

متن کامل

Bijections for 2-plane trees and ternary trees

According to the Fibonacci number which is studied by Prodinger et al., we introduce the 2-plane tree which is a planted plane tree with each of its vertices colored with one of two colors and qqppppppppppppppppp -free. The similarity of the enumeration between 2-plane trees and ternary trees leads us to build several bijections. Especially, we found a bijection between the set of 2-plane trees...

متن کامل

Multichains, non-crossing partitions and trees

In a previous paper El], we proved results -about the enumer;ation of certain types of chains in the non-crossing partition lattice T, and its, generalizations. In this paper we present bijections to certain classes of trees which reprove one theorem [l, Corollary 3.41 and provide a combinatoridi proof for the other [I, Theorem 5.31. We begin with a review of the definitions. A set partition X ...

متن کامل

Bijections for Cayley trees, spanning trees, and their q-analogues

We construct a family of extremely simple bijections that yield Cayley’s famous formula for counting trees. The weight preserving properties of these bijections furnish a number of multivariate generating functions for weighted Cayley trees. Essentially the same idea is used to derive bijective proofs and q-analogues for the number of spanning trees of other graphs, including the complete bipar...

متن کامل

Pattern Avoidance in Generalized Non-crossing Trees

Abstract. In this paper, the problem of pattern avoidance in generalized non-crossing trees is studied. The generating functions for generalized non-crossing trees avoiding patterns of length one and two are obtained. Lagrange inversion formula is used to obtain the explicit formulas for some special cases. Bijection is also established between generalized non-crossing trees with special patter...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Combinatorics

سال: 2021

ISSN: ['0219-3094', '0218-0006']

DOI: https://doi.org/10.1007/s00026-021-00531-w